Drawing Trees Nicely with T E X 1

نویسنده

  • Derick Wood
چکیده

Various algorithms have been proposed for the diicult problem of producing aesthetically pleasing drawings of trees, see 14, 16] but implementations only exist as \special purpose software", designed for special environments. Therefore, many users resort to the drawing facilities available on most personal computers, but the gures obtained in this way still look \hand-drawn"; their quality is inferior to the quality of the surrounding text that can be realized by today's high quality text processing systems. In this paper we present an entirely new solution that integrates a tree drawing algorithm into one of the best text processing systems available. More precisely, we present a T E X macro package TreeT E X that produces a drawing of a tree from a purely logical description. Our approach has three advantages. First, labels for nodes can be handled in a reasonable way. On the one hand, the tree drawing algorithm can compute the widths of the labels and take them into account for the positioning of the nodes; on the other hand, all the textual parts of the document can be treated uniformly. Second, TreeT E X can be trivially ported to any site running T E X. Finally, modularity in the description of a tree and T E X's macro capabilities allow for libraries of subtrees and tree classes. In addition, we have implemented an option that produces drawings which make the structure of the trees more obvious to the human eye, even though they may not be as aesthetically pleasing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drawing Trees Nicely with TeX

SUMMARY We present a new solution to the tree drawing problem that integrates an excellent tree drawing algorithm into one of the best text processing systems available. More precisely, we present a T E X macro package called TreeT E X that produces drawings of trees from a purely logical description. Our approach has three advantages: labels for nodes can be handled in a reasonable way; portin...

متن کامل

Mixed Roman domination and 2-independence in trees

‎‎Let $G=(V‎, ‎E)$ be a simple graph with vertex set $V$ and edge set $E$‎. ‎A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacent‎‎or incident to at least one element $yin Vcup E$ for which $f(y)=2$‎. ‎The weight of an‎‎MRDF $f$ is $sum _{xin Vcup E} f(x)$‎. ‎The mi...

متن کامل

Products of Infinitely Many Perfect Trees

Statements (l)-(3) all say the same thing: they are interdeducible. In the 1960s, (2) was noted when pK adds a single Sacks real (that is, when K = 1) and (2) for arbitrary K was asked. Baumgartner (in the early 1970s) derived (2) for K = d < co from HLd; he then raised the question of HL^ and derived (2) from it. Finally, Harrington (in the late 1970s) derived a version of (3), where the funct...

متن کامل

A New Algorithm for Compact Box-drawing of Trees

Several researchers has discussed the Box-drawing of trees. In this paper the more recent algorithms are investigated and a new one has been introduced, in which each cell is drawn by a square box, no two boxes overlap each other, all boxes corresponding to siblings cells of the tree have the same x-coordinate at their left and right sides, and a parent cell is drawn nearly at the middle of its...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996